/*
自己选择的路 ,跪着也要走完。朋友们 , 虽然这个世界日益浮躁起来,只
要能够为了当时纯粹的梦想和感动坚持努力下去 , 不管其它人怎么样,我
们也能够保持自己的本色走下去。
To the world , you will be a person , but to a person , you
will be the world .                               ——AKPower
*/
//作者:AKPower
//算法:
#include <iostream>
#include <cmath>
#include <algorithm>
#include <cstring>
#include <vector>
#include <map>
#include <queue>
#include <cstdio>
#include <string>
#include <stack>
#include <set>
#define IOS ios::sync_with_stdio(false), cin.tie(0)
using namespace std;
typedef long long ll;
// const ll mod=(1<<15)-1;

int main()
{
    IOS;
    ll T, n;
    cin >> T;
    while (T--)
    {
        cin >> n;
        ll i;
        for (i = 2; i <= 15; i++)
        {
            ll mod = (1 << i) - 1;
            if (n % mod == 0)
            {
                cout << "YE5" << endl;
                break;
            }
        }
        if (i > 15)
        {
            cout << "N0" << endl;
        }
    }
    getchar();
    getchar();
    return 0;
}
